Proximal Point Method on Finslerian Manifolds and the “Effort–Accuracy” Trade-off
نویسندگان
چکیده
منابع مشابه
Proximal Point Method on Finslerian Manifolds and the "Effort-Accuracy" Trade-off
In this paper we consider minimization problems with constraints. We will show that if the set of constraints is a Finslerian manifold of non positive flag curvature, and the objective function is differentiable and satisfies the property Kurdyka-Lojasiewicz, then the proximal point method is naturally extended to solve that class of problems. We will prove that the sequence generated by our me...
متن کاملFinslerian Lie Derivative and Landsberg Manifolds
In this paper we take a close look at Lie derivatives on a Finsler bundle and give a geometric meaning to the vanishing of the mixed curvature of certain covariant derivatives on a Finsler bundle. As an application, we obtain some characterizations of Landsberg manifolds.
متن کاملThe proximal point method revisited∗
In this short survey, I revisit the role of the proximal point method in large scale optimization. I focus on three recent examples: a proximally guided subgradient method for weakly convex stochastic approximation, the prox-linear algorithm for minimizing compositions of convex functions and smooth maps, and Catalyst generic acceleration for regularized Empirical Risk Minimization.
متن کاملProximal Point Methods with Bregman Function on Riemannian Manifolds
We study the proximal point algorithm with Bregman type distance to minimize the problem , , . ) ( min S x to s x f ∈ where S is an open convex subset of a complete simply connected Riemannian manifold M of non positive sectional curvature and f is a convex function in this manifold. Introducing a strong assumption on the geodesic triangle on this manifold we obtain the convergence of the seque...
متن کاملA proximal point algorithm for DC fuctions on Hadamard manifolds
An extension of a proximal point algorithm for difference of two convex functions is presented in the context of Riemannian manifolds of nonposite sectional curvature. If the sequence generated by our algorithm is bounded it is proved that every cluster point is a critical point of the function (not necessarily convex) under consideration, even if minimizations are performed inexactly at each i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Optimization Theory and Applications
سال: 2013
ISSN: 0022-3239,1573-2878
DOI: 10.1007/s10957-013-0483-5